Congruence formula for certain dihedral twists

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

For Certain Congruence Classes Of

We give a criterion to check if, given a prime number , the only rational points of the modular curve "! are trivial (i.e. cusps or points furnished by complex multiplication). We then prove that this criterion is verified for large enough satisfying some explicit congruences. c # 200X Académie des sciences/Éditions scientifiques et médicales Elsevier SAS

متن کامل

Scissors Congruence for Certain k-polygons

It has been proved that any two polygons having the same area are scissors congruent by Bolyai in 1832 and by Gerwien in 1833, respectively. It is well known that the concepts of congruence and scissors congruence are different for the set of polygons in the Euclidean plane. Let C be a unit circle divided into n parts equally. We denote the set of ends of these parts on C by S = {P0, P1, . . . ...

متن کامل

On a certain generalization of spherical twists

This note gives a generalization of spherical twists, and describe the autoequivalences associated to certain non-spherical objects. Typically these are obtained by deforming the structure sheaves of (0,−2)-curves on threefolds, or deforming P-objects introduced by D.Huybrecht and R.Thomas.

متن کامل

On equivariant global epsilon constants for certain dihedral extensions

We consider a conjecture of Bley and Burns which relates the epsilon constant of the equivariant Artin L-function of a Galois extension of number fields to certain natural algebraic invariants. For an odd prime number p, we describe an algorithm which either proves the conjecture for all degree 2p dihedral extensions of the rational numbers or finds a counterexample. We apply this to show the c...

متن کامل

A counting formula for certain hierarchical orderings

A hierarchy is a distribution of elements on levels. For a given number of elements a certain hierarchy can be arrangend in a finite number of ways. We provide a counting formula for certain types of hierarchies. Mainly, this formula is a sum over the integer partitions of the number of elements. Furthermore, several basic combinatorical numbers like the Stirling numbers of the second kind, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2014

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-2014-06232-6